منابع مشابه
Spherical two-distance sets
A set S of unit vectors in n−dimensional Euclidean space is called spherical two-distance set, if there are two numbers a and b so that the inner products of distinct vectors of S are either a or b. The largest cardinality g(n) of spherical two-distance sets does not exceed n(n+3)/2. This upper bound is known to be tight for n = 2, 6, 22. The set of midpoints of the edges of a regular simplex g...
متن کاملNew Bounds for Equiangular Lines and Spherical Two-Distance Sets
The set of points in a metric space is called an s-distance set if pairwise distances between these points admit only s distinct values. Two-distance spherical sets with the set of scalar products {α,−α}, α ∈ [0, 1), are called equiangular. The problem of determining the maximal size of s-distance sets in various spaces has a long history in mathematics. We determine a new method of bounding th...
متن کاملSpherical Means and Pinned Distance Sets
We use mixed norm estimates for the spherical averaging operator to obtain some results concerning pinned distance sets.
متن کاملNew Maximal Two-Distance Sets
A two-distance set in E is a point set X in the d-dimensional Euclidean space such that the distances between distinct points in X assume only two different nonzero values. Based on results from classical distance geometry, we develop an algorithm to classify, for a given d, all maximal (largest possible) two-distance sets in E. Using this algorithm we have completed the full classification for...
متن کاملDifferent-Distance Sets in a Graph
A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2009
ISSN: 0097-3165
DOI: 10.1016/j.jcta.2008.09.003